TSTP Solution File: ITP182^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP182^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:15 EDT 2024
% Result : Theorem 0.45s 0.66s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 33 ( 11 unt; 19 typ; 0 def)
% Number of atoms : 17 ( 3 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 160 ( 6 ~; 2 |; 0 &; 151 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 8 con; 0-5 aty)
% Number of variables : 21 ( 0 ^ 21 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
list_P227219501e_name: $tType ).
thf(decl_sort2,type,
produc367475239e_name: $tType ).
thf(decl_sort3,type,
pi: $tType ).
thf(decl_sort4,type,
name: $tType ).
thf(decl_sort5,type,
late_subject: $tType ).
thf(decl_sort6,type,
set_Pr1834926343_pi_pi: $tType ).
thf(decl_34,type,
late_BoundOutputS: name > late_subject ).
thf(decl_43,type,
cons_P1213805021e_name: produc367475239e_name > list_P227219501e_name > list_P227219501e_name ).
thf(decl_46,type,
nil_Pr743626285e_name: list_P227219501e_name ).
thf(decl_84,type,
perm_name_pi: list_P227219501e_name > pi > pi ).
thf(decl_119,type,
ord_le630093991_pi_pi: set_Pr1834926343_pi_pi > set_Pr1834926343_pi_pi > $o ).
thf(decl_121,type,
produc1570949143e_name: name > name > produc367475239e_name ).
thf(decl_144,type,
id_pi: set_Pr1834926343_pi_pi ).
thf(decl_146,type,
strong2129052853vative: pi > pi > late_subject > name > set_Pr1834926343_pi_pi > $o ).
thf(decl_161,type,
p2: pi ).
thf(decl_163,type,
rel: set_Pr1834926343_pi_pi ).
thf(decl_165,type,
aa: name ).
thf(decl_166,type,
x: name ).
thf(decl_167,type,
y: name ).
thf(conj_0,conjecture,
strong2129052853vative @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( late_BoundOutputS @ aa ) @ y @ rel,
file('/export/starexec/sandbox/tmp/tmp.Yj6kf8N1jD/E---3.1_17909.p',conj_0) ).
thf(fact_19_name__swap,axiom,
! [X1: name,X2: name,X15: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X15 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X15 ) ),
file('/export/starexec/sandbox/tmp/tmp.Yj6kf8N1jD/E---3.1_17909.p',fact_19_name__swap) ).
thf(fact_194_derivativeReflexive,axiom,
! [X270: set_Pr1834926343_pi_pi,X271: pi,X272: late_subject,X273: name] :
( ( ord_le630093991_pi_pi @ id_pi @ X270 )
=> ( strong2129052853vative @ X271 @ X271 @ X272 @ X273 @ X270 ) ),
file('/export/starexec/sandbox/tmp/tmp.Yj6kf8N1jD/E---3.1_17909.p',fact_194_derivativeReflexive) ).
thf(fact_0_Id,axiom,
ord_le630093991_pi_pi @ id_pi @ rel,
file('/export/starexec/sandbox/tmp/tmp.Yj6kf8N1jD/E---3.1_17909.p',fact_0_Id) ).
thf(c_0_4,negated_conjecture,
~ ( strong2129052853vative @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( late_BoundOutputS @ aa ) @ y @ rel ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
~ ( strong2129052853vative @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( late_BoundOutputS @ aa ) @ y @ rel ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X935: name,X936: name,X937: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X935 @ X936 ) @ nil_Pr743626285e_name ) @ X937 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X936 @ X935 ) @ nil_Pr743626285e_name ) @ X937 ) ),
inference(variable_rename,[status(thm)],[fact_19_name__swap]) ).
thf(c_0_7,negated_conjecture,
~ ( strong2129052853vative @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ y @ x ) @ nil_Pr743626285e_name ) @ p2 ) @ ( late_BoundOutputS @ aa ) @ y @ rel ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: name,X2: name,X7: pi] :
( ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X1 @ X2 ) @ nil_Pr743626285e_name ) @ X7 )
= ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ X2 @ X1 ) @ nil_Pr743626285e_name ) @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X863: set_Pr1834926343_pi_pi,X864: pi,X865: late_subject,X866: name] :
( ~ ( ord_le630093991_pi_pi @ id_pi @ X863 )
| ( strong2129052853vative @ X864 @ X864 @ X865 @ X866 @ X863 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_194_derivativeReflexive])])]) ).
thf(c_0_10,negated_conjecture,
~ ( strong2129052853vative @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ x @ y ) @ nil_Pr743626285e_name ) @ p2 ) @ ( perm_name_pi @ ( cons_P1213805021e_name @ ( produc1570949143e_name @ x @ y ) @ nil_Pr743626285e_name ) @ p2 ) @ ( late_BoundOutputS @ aa ) @ y @ rel ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
thf(c_0_11,plain,
! [X3: late_subject,X1: name,X7: pi,X65: set_Pr1834926343_pi_pi] :
( ( strong2129052853vative @ X7 @ X7 @ X3 @ X1 @ X65 )
| ~ ( ord_le630093991_pi_pi @ id_pi @ X65 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
ord_le630093991_pi_pi @ id_pi @ rel,
inference(split_conjunct,[status(thm)],[fact_0_Id]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18 % Problem : ITP182^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.20 % Command : run_E %s %d THM
% 0.20/0.41 % Computer : n007.cluster.edu
% 0.20/0.41 % Model : x86_64 x86_64
% 0.20/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.41 % Memory : 8042.1875MB
% 0.20/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.41 % CPULimit : 300
% 0.20/0.41 % WCLimit : 300
% 0.20/0.41 % DateTime : Fri May 3 11:58:35 EDT 2024
% 0.20/0.41 % CPUTime :
% 0.43/0.61 Running higher-order theorem proving
% 0.43/0.61 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Yj6kf8N1jD/E---3.1_17909.p
% 0.45/0.66 # Version: 3.1.0-ho
% 0.45/0.66 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.45/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.45/0.66 # Starting new_ho_10 with 300s (1) cores
% 0.45/0.66 # Starting new_bool_6 with 300s (1) cores
% 0.45/0.66 # Starting lpo8_s with 300s (1) cores
% 0.45/0.66 # new_bool_6 with pid 18004 completed with status 0
% 0.45/0.66 # Result found by new_bool_6
% 0.45/0.66 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.45/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.45/0.66 # Starting new_ho_10 with 300s (1) cores
% 0.45/0.66 # Starting new_bool_6 with 300s (1) cores
% 0.45/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 0.45/0.66 # Search class: HGHSM-FFMM31-MHFFFSBN
% 0.45/0.66 # partial match(2): HGHSM-FSLM31-MHFFFSBN
% 0.45/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.66 # Starting new_ho_10 with 163s (1) cores
% 0.45/0.66 # new_ho_10 with pid 18006 completed with status 0
% 0.45/0.66 # Result found by new_ho_10
% 0.45/0.66 # Preprocessing class: HSLMSMSMSSSNHFA.
% 0.45/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.66 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.45/0.66 # Starting new_ho_10 with 300s (1) cores
% 0.45/0.66 # Starting new_bool_6 with 300s (1) cores
% 0.45/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.0,,1,20000,1.0)
% 0.45/0.66 # Search class: HGHSM-FFMM31-MHFFFSBN
% 0.45/0.66 # partial match(2): HGHSM-FSLM31-MHFFFSBN
% 0.45/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.66 # Starting new_ho_10 with 163s (1) cores
% 0.45/0.66 # Preprocessing time : 0.005 s
% 0.45/0.66 # Presaturation interreduction done
% 0.45/0.66
% 0.45/0.66 # Proof found!
% 0.45/0.66 # SZS status Theorem
% 0.45/0.66 # SZS output start CNFRefutation
% See solution above
% 0.45/0.66 # Parsed axioms : 557
% 0.45/0.66 # Removed by relevancy pruning/SinE : 503
% 0.45/0.66 # Initial clauses : 95
% 0.45/0.66 # Removed in clause preprocessing : 7
% 0.45/0.66 # Initial clauses in saturation : 88
% 0.45/0.66 # Processed clauses : 138
% 0.45/0.66 # ...of these trivial : 3
% 0.45/0.66 # ...subsumed : 7
% 0.45/0.66 # ...remaining for further processing : 128
% 0.45/0.66 # Other redundant clauses eliminated : 26
% 0.45/0.66 # Clauses deleted for lack of memory : 0
% 0.45/0.66 # Backward-subsumed : 0
% 0.45/0.66 # Backward-rewritten : 3
% 0.45/0.66 # Generated clauses : 87
% 0.45/0.66 # ...of the previous two non-redundant : 38
% 0.45/0.66 # ...aggressively subsumed : 0
% 0.45/0.66 # Contextual simplify-reflections : 0
% 0.45/0.66 # Paramodulations : 51
% 0.45/0.66 # Factorizations : 0
% 0.45/0.66 # NegExts : 0
% 0.45/0.66 # Equation resolutions : 32
% 0.45/0.66 # Disequality decompositions : 0
% 0.45/0.66 # Total rewrite steps : 27
% 0.45/0.66 # ...of those cached : 10
% 0.45/0.66 # Propositional unsat checks : 0
% 0.45/0.66 # Propositional check models : 0
% 0.45/0.66 # Propositional check unsatisfiable : 0
% 0.45/0.66 # Propositional clauses : 0
% 0.45/0.66 # Propositional clauses after purity: 0
% 0.45/0.66 # Propositional unsat core size : 0
% 0.45/0.66 # Propositional preprocessing time : 0.000
% 0.45/0.66 # Propositional encoding time : 0.000
% 0.45/0.66 # Propositional solver time : 0.000
% 0.45/0.66 # Success case prop preproc time : 0.000
% 0.45/0.66 # Success case prop encoding time : 0.000
% 0.45/0.66 # Success case prop solver time : 0.000
% 0.45/0.66 # Current number of processed clauses : 43
% 0.45/0.66 # Positive orientable unit clauses : 19
% 0.45/0.66 # Positive unorientable unit clauses: 0
% 0.45/0.66 # Negative unit clauses : 5
% 0.45/0.66 # Non-unit-clauses : 19
% 0.45/0.66 # Current number of unprocessed clauses: 68
% 0.45/0.66 # ...number of literals in the above : 187
% 0.45/0.66 # Current number of archived formulas : 0
% 0.45/0.66 # Current number of archived clauses : 83
% 0.45/0.66 # Clause-clause subsumption calls (NU) : 870
% 0.45/0.66 # Rec. Clause-clause subsumption calls : 388
% 0.45/0.66 # Non-unit clause-clause subsumptions : 5
% 0.45/0.66 # Unit Clause-clause subsumption calls : 41
% 0.45/0.66 # Rewrite failures with RHS unbound : 0
% 0.45/0.66 # BW rewrite match attempts : 18
% 0.45/0.66 # BW rewrite match successes : 14
% 0.45/0.66 # Condensation attempts : 138
% 0.45/0.66 # Condensation successes : 0
% 0.45/0.66 # Termbank termtop insertions : 15626
% 0.45/0.66 # Search garbage collected termcells : 6118
% 0.45/0.66
% 0.45/0.66 # -------------------------------------------------
% 0.45/0.66 # User time : 0.020 s
% 0.45/0.66 # System time : 0.007 s
% 0.45/0.66 # Total time : 0.027 s
% 0.45/0.66 # Maximum resident set size: 3576 pages
% 0.45/0.66
% 0.45/0.66 # -------------------------------------------------
% 0.45/0.66 # User time : 0.038 s
% 0.45/0.66 # System time : 0.010 s
% 0.45/0.66 # Total time : 0.048 s
% 0.45/0.66 # Maximum resident set size: 2872 pages
% 0.45/0.66 % E---3.1 exiting
% 0.45/0.66 % E exiting
%------------------------------------------------------------------------------